Mining Multiple Comprehensible Classification Rules Using Genetic Programming
نویسندگان
چکیده
Genetic Programming (GP) has been emerged as a promising approach to deal with classification task in data mining. This work extends the tree representation of GP to evolve multiple comprehensible IF-THEN classification rules. In the paper, we introduce a concept mapping technique for fitness evaluation of individuals. A covering algorithm that employs an artificial immune system-like memory vector is utilized to produce multiple rules as well as to remove redundant rules. The proposed GP classifier is validated upon nine benchmark datasets and the simulation results confirm the viability and effectiveness of the GP approach for solving data mining problems in a wide spectrum of application domains.
منابع مشابه
Discovering comprehensible classification rules using Genetic Programming: a case study in a medical domain
This work it is intended to discover classification rules for diagnosing certain pathologies. These rules are capable of discriminating among 12 different pathologies, whose main symptom is chest pain. In order to discover these rules it was used genetic programming as well as some concepts of data mining, particularly the emphasis on the discovery of comprehensible knowledge.
متن کاملDiscovering comprehensible classification rules by using Genetic Programming: a case study in a medical domain
This work it is intended to discover classification rules for diagnosing certain pathologies. These rules are capable of discriminating among 12 different pathologies, whose main symptom is chest pain. In order to discover these rules it was used genetic programming as well as some concepts of data mining, particularly the emphasis on the discovery of comprehensible knowledge.
متن کاملData Mining with Constrained-Syntax Genetic Programming: Applications in Medical Data Set
This work is intended to discover classification rules for diagnosing certain pathologies. In order to discover these rules we have developed a new constrained-syntax genetic programming algorithm based on some concepts of data mining, particularly with emphasis on the discovery of comprehensible knowledge. We compare the performance of the proposed GP algorithm with a genetic algorithm and wit...
متن کاملDiscovering interesting classification rules with genetic programming
Data mining deals with the problem of discovering novel and interesting knowledge from large amount of data. This problem is often performed heuristically when the extraction of patterns is difficult using standard query mechanisms or classical statistical methods. In this paper a genetic programming framework, capable of performing an automatic discovery of classification rules easily comprehe...
متن کاملA Distributed-Population Genetic Algorithm for Discovering Interesting Prediction Rules
In data mining the quality of prediction rules basically involves three criteria: accuracy, comprehensible and interestingness. The majority of the rule induction literature focuses on discovering accurate, comprehensible rules. In this paper we also take these two criteria into account, but we go beyond them in the sense that we aim at discovering rules that are interesting (surprising) for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002